Modelling and solving temporal reasoning as propositional satisfiability
نویسندگان
چکیده
منابع مشابه
Modelling and solving temporal reasoning as propositional satisfiability
Article history: Received 24 November 2006 Received in revised form 2 June 2008 Accepted 11 June 2008 Available online 19 June 2008
متن کاملGrid based propositional satisfiability solving
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Antti E. J. Hyvärinen Name of the doctoral dissertation Grid Based Propositional Satisfiability Solving Publisher School of Science Unit Department of Information and Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 118/2011 Field of research Theoretical Computer Science Manuscript submitted 1...
متن کاملSymbolic Techniques in Propositional Satisfiability Solving
• Late 1990s: Technical breakthroughs – clause learning and memory locality • Mid 2000s: SAT solvers can handle problems with 1M variables! • Late 2000s: " NP-easy " – SAT solvers as generic problem solvers with the citation: " For fundamental contributions to the development of high-performance Boolean satisfiability solvers " 2 Critical Observation: There is basically only one algorithm that ...
متن کاملSolving Open Quasigroup Problems by Propositional Reasoning
There are many open problems in the study of quasigroups. Recently, automated techniques have been employed to attack these open problems. In this paper, we show how a propositional satissability prover is used to solve many open problems in quasigroups. Our success relies on a powerful propositional prover called SATO and a useful technique called the cyclic group construction. We provide deta...
متن کاملReformulating Propositional Satisfiability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2008
ISSN: 0004-3702
DOI: 10.1016/j.artint.2008.06.003